Discrete Rule-Based Local Search Metaheuristic for Bézier Curve Parameterization
نویسندگان
چکیده
This paper introduces a new method for solving the parameterization problem of the Bézier curve of a certain degree that approximates a given collection of data points. Our method is based on a discrete based-on-rules local search metaheuristic approach for optimization problems. The method is applied to some simple yet illustrative examples for the cases of 2D and 3D curves. Our experimental results show that the presented method performs very well, being able to fit the data points with a high degree of accuracy.
منابع مشابه
Tabu Search-Based Method for Bézier Curve Parameterization
A very important issue in many applied fields is to construct the fitting curve that approximates a given set of data points optimally in the sense of least-squares. This problem arises in a number of areas, such as computer-aided design & manufacturing (CAD/CAM), virtual reality, medical imaging, computer graphics, computer animation, and many others. This is also a hard problem, because it is...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملModified Sine-Cosine Algorithm for Sizing Optimization of Truss Structures with Discrete Design Variables
This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملBézier Parameterization for Optimal Control by Differential Evolution
Direct solution methods for optimal control problems treat them from the perspective of global optimization: perform a global search for the control function that optimizes the required objective. Increasingly, Differential Evolution is being recognized as a powerful global optimizer for optimal control. A parameterization technique is required, which can represent control functions using a sma...
متن کامل